The friendship paradox in scale-free networks

Our friends have more friends than we do. That is the basis of the friendship paradox. In mathematical terms, the mean number of friends of friends is higher than the mean number of friends. In the present study, we analyzed the relationship between the mean degree of vertices (individuals), 〈k〉, and the mean number of friends of friends, 〈kFF 〉, in scale-free networks with degrees ranging from a minimum degree (kmin) to a maximum degree (kmax). We deduced an expression for 〈kFF 〉−〈k〉 for scale-free networks following a power-law distribution with a given scaling parameter (α). Based on this expression, we can quantify how the degree distribution of a scale-free network affects the mean number of friends of friends.